A note on completely positive relaxations of quadratic problems in a multiobjective framework

Abstract In a single-objective setting, nonconvex quadratic problems can equivalently be reformulated as convex over the cone of completely positive matrices. small dimensions this equals matrices which are entrywise nonnegative and semidefinite, so reformulation solved via SDP solvers. Considering multiobjective problems, naturally question arises, whether advantage reformulations extends to multicriteria framework. note, we show that approach only finds supported nondominated points, already found by using weighted sum scalarization problem, i.e. it is not suitable for problems.